- Main Page
- Information on the Institution
- General Description of the Institution
- Address of İzmir University of Economics
- Academic Authorities
- Academic Calendar
- Recognition of Prior Learning
- Recognition of Study Abroad
- List of Programs Offered
- General Admission Requirements
- General Registration Procedures
- ECTS Credit Allocation
- Grading
- Arrangements for Academic Guidance
- Internationalization
- Institutional ECTS Coordinator
- Departmental Erasmus Coordinators
- Degree Programs
- Computer Engineering
- Qualification Awarded
- Level of Qualification
- Specific Admission Requirements
- Qualification Requirements and Regulations
- Recognition of Prior Learning
- Profile of the Program
- Program Outcomes
- Course & Program Outcomes Matrix
- Occupational Profiles of Graduates
- Access to Further Studies
- Program Structure
- Course Structure Diagram with Credits
- Exam Regulations & Assessment & Grading
- Graduation Requirements
- Mode of Study
- Program Director (or Equivalent)
- Evaluation Questionnaires
- Courses
- General Information For Students
- About İzmir
- Cost of Living
- Accommodation
- Meals
- Medical Facilities
- Facilities for Special Needs Students
- Career Guidance Center
- Insurance
- Financial Support for Students
- Registrar's Office
- Learning Facilities
- International Programs
- Practical Information for Exchange Students
- Language Courses
- Internships
- Sports and Leisure Facilities
- Student Associations
- Useful Phone Numbers
- Diploma Supplement
- Erasmus Policy Statement
- National Qualifications
- Bologna Commission
COURSE INTRODUCTION AND APPLICATION INFORMATION
ce.cs.ieu.edu.tr
| Course Name | |
| Code | Semester | Theory (hour/week) | Application/Lab (hour/week) | Local Credits | ECTS |
|---|---|---|---|---|---|
| Fall/Spring |
| Prerequisites |
| ||||||||
| Course Language | |||||||||
| Course Type | Elective | ||||||||
| Course Level | - | ||||||||
| Mode of Delivery | - | ||||||||
| Teaching Methods and Techniques of the Course | |||||||||
| Course Coordinator | - | ||||||||
| Course Lecturer(s) | |||||||||
| Assistant(s) | - | ||||||||
| Course Objectives | |
| Learning Outcomes | The students who succeeded in this course;
|
| Course Description |
|
| Core Courses | |
| Major Area Courses | ||
| Supportive Courses | X | |
| Media and Managment Skills Courses | ||
| Transferable Skill Courses |
WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES
| Week | Subjects | Required Materials |
| 1 | Introduction to and motivation for Mathematical Modelling | Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Chapter 1 |
| 2 | Optimization in production and inventory systems | Lecture notes |
| 3 | Optimization in production and inventory systems | Lecture notes |
| 4 | MIP algorithms | Yves Pochet, Laurance A. Wolsey,.Production Planning by Mixed Integer Programming, Springer, ISBN 9780387299594, Chapters 2 and 3 |
| 5 | MIP algorithms | Yves Pochet, Laurance A. Wolsey,.Production Planning by Mixed Integer Programming, Springer, ISBN 9780387299594, Chapters 2 and 3 |
| 6 | Starting with an MRP Model | Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Chapter 2 |
| 7 | Starting with an MRP Model | Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Chapter 3 |
| 8 | Extending to an MRP II Model and Further Improvements | Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Chapter 4 |
| 9 | Software implementations | Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Chapter 7 |
| 10 | Midterm Examination | - |
| 11 | Capacitated Lot Sizing Problems and Reformulations | M Denizel,H Sural. On alternative mixed integer programming formulations and LPbased heuristics for lotsizing with setup times. Journal of the Operational Research Society (2006) 57, 389–399 |
| 12 | Capacitated Lot Sizing Problems and Reformulations | M Denizel,H Sural. On alternative mixed integer programming formulations and LPbased heuristics for lotsizing with setup times. Journal of the Operational Research Society (2006) 57, 389–399 |
| 13 | Discrete Lot Sizing and Scheduling Problem and Sequence Dependent Setups | A. Drexl , A. Kimms. Lot sizing and scheduling Survey and extensions. European Journal of Operational Research 99 (1997) 221–235 |
| 14 | Continuous Setup and Proportional Lot Sizing and Scheduling Problems | A. Drexl , A. Kimms. Lot sizing and scheduling Survey and extensions. European Journal of Operational Research 99 (1997) 221–235 |
| 15 | Project Presentations | |
| 16 | Review of the Semester |
| Course Notes/Textbooks | Stefan Voβ, David L. Voodruff. Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Second Edition, Springer, ISBN 9783540298786 Yves Pochet, Laurance A. Wolsey,.Production Planning by Mixed Integer Programming, Springer, ISBN 9780387299594 |
| Suggested Readings/Materials | Lecture PowerPoint slides,Reading Handouts |
EVALUATION SYSTEM
| Semester Activities | Number | Weigthing |
| Participation | 1 | 10 |
| Laboratory / Application | ||
| Field Work | ||
| Quizzes / Studio Critiques | 1 | 5 |
| Portfolio | ||
| Homework / Assignments | 1 | 10 |
| Presentation / Jury | ||
| Project | 1 | 15 |
| Seminar / Workshop | ||
| Oral Exam | ||
| Midterm | 1 | 25 |
| Final Exam | 1 | 35 |
| Total |
| Weighting of Semester Activities on the Final Grade | 30 | 65 |
| Weighting of End-of-Semester Activities on the Final Grade | 1 | 35 |
| Total |
ECTS / WORKLOAD TABLE
| Semester Activities | Number | Duration (Hours) | Workload |
|---|---|---|---|
| Course Hours (Including exam week: 16 x total hours) | 16 | 3 | 48 |
| Laboratory / Application Hours (Including exam week: 16 x total hours) | 16 | ||
| Study Hours Out of Class | 15 | 1 | |
| Field Work | |||
| Quizzes / Studio Critiques | 1 | 5 | |
| Portfolio | |||
| Homework / Assignments | 1 | 2 | |
| Presentation / Jury | |||
| Project | 1 | 18 | |
| Seminar / Workshop | |||
| Oral Exam | |||
| Midterms | 1 | 9 | |
| Final Exams | 1 | 15 | |
| Total | 112 |
COURSE LEARNING OUTCOMES AND PROGRAM QUALIFICATIONS RELATIONSHIP
| # | Program Competencies/Outcomes | * Contribution Level | ||||
1 | 2 | 3 | 4 | 5 | ||
| 1 | Adequate knowledge in Mathematics, Science and Computer Engineering; ability to use theoretical and applied information in these areas to model and solve Computer Engineering problems | X | ||||
| 2 | Ability to identify, define, formulate, and solve complex Computer Engineering problems; ability to select and apply proper analysis and modeling methods for this purpose | X | ||||
| 3 | Ability to design a complex computer based system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose | X | ||||
| 4 | Ability to devise, select, and use modern techniques and tools needed for Computer Engineering practice | X | ||||
| 5 | Ability to design and conduct experiments, gather data, analyze and interpret results for investigating Computer Engineering problems | X | ||||
| 6 | Ability to work efficiently in Computer Engineering disciplinary and multi-disciplinary teams; ability to work individually | |||||
| 7 | Ability to communicate effectively in Turkish, both orally and in writing; knowledge of a minimum of two foreign languages | |||||
| 8 | Recognition of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself | |||||
| 9 | Awareness of professional and ethical responsibility | |||||
| 10 | Information about business life practices such as project management, risk management, and change management; awareness of entrepreneurship, innovation, and sustainable development | |||||
| 11 | Knowledge about contemporary issues and the global and societal effects of engineering practices on health, environment, and safety; awareness of the legal consequences of Computer Engineering solutions | |||||
*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest